package algorithm.questions;

public class Lingxing {

	public static void main(String[] args) {
		printf(5);
	}

	public static void printf(int x) {
		int n = 2 * x - 1;
		for (int i = 1; i <= n; i++) {
			int a = i > x ? n - i + 1 : i;
			int b = x - a + 1;
			for (int j = 1; j <= n; j++) {
				if (j == b && a > 0) {
					System.out.print("*");
					b += 2;
					a--;
				} else
					System.out.print("-");
			}
			if (i != n)
				System.out.println();
		}
	}
}
